Can flashing objects grab visual indexes in multiple object tracking?
نویسندگان
چکیده
منابع مشابه
Visual Learning in Multiple-Object Tracking
BACKGROUND Tracking moving objects in space is important for the maintenance of spatiotemporal continuity in everyday visual tasks. In the laboratory, this ability is tested using the Multiple Object Tracking (MOT) task, where participants track a subset of moving objects with attention over an extended period of time. The ability to track multiple objects with attention is severely limited. Re...
متن کاملOcclusion Reasoning for Multiple Object Visual Tracking
Occlusion reasoning for visual object tracking in uncontrolled environments is a challenging problem. It becomes significantly more difficult when dense groups of indistinguishable objects are present in the scene that cause frequent inter-object interactions and occlusions. We present several practical solutions that tackle the inter-object occlusions for video surveillance applications. In pa...
متن کاملCoping with occlusions in visual tracking of multiple objects
The problem of visual tracking of multiple objects is considered in this paper. Special emphasis is devoted to the case when two OT more objects overlap with respect to the visual system causing occlusion. The algorithm is based on the Kalman filtering and Binary Space Partition tree representations of the objects geometry. The real-time implementation of the algorithm is ezperimentally tested ...
متن کاملVisual Indexes, Objects, and Nonconceptual Reference
Not long ago I discovered that, although coming from a very different perspective, I had taken a position on a set of questions that philosophers had been worrying about for much of the past 30 or more years. My clandestine involvement in philosophical issues began when a computer science colleague and I were trying to build a model of geometrical reasoning that would draw a diagram and notice ...
متن کاملGRAB - Inverted Indexes with Low Storage Overhead
A searching command (grab) for maintaining indexes combines acceptably fast searching with very low storage overhead. It looks like grep except that it demands a preindexing pass, looks only for whole words, and runs faster. As an example of performance, consider the time to search for single words in a 7.8 Mbyte file (the Brown corpus of English). The times below are in seconds on a DEC 8600 r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/3.9.581